Balancedness of subclasses of circular-arc graphs
نویسندگان
چکیده
CONICET and Depto. de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina CONICET and Depto. de Matemática and Instituto de Cálculo, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina, and Depto. de Ingenierı́a Industrial, FCFM, Universidad de Chile, Santiago, Chile Instituto de Ciencias, Universidad Nacional de General Sarmiento, Los Polvorines, Argentina CNRS and LIMOS, UFR Sciences et Technologies, Université Blaise Pascal, Clermont-Ferrand, France
منابع مشابه
Balancedness of some subclasses of circular-arc graphs
A graph is balanced if its clique-vertex incidence matrix is balanced, i.e., it does not contain a square submatrix of odd order with exactly two ones per row and per column. Interval graphs, obtained as intersection graphs of intervals of a line, are well-known examples of balanced graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. Circular-arc graphs gener...
متن کاملOn some subclasses of circular-arc graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...
متن کاملNormal Helly circular-arc graphs and its subclasses
A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model, and if there are no two arcs covering the circle, thenM is a normal Helly circular-arc model. A Helly (resp. proper Helly, unit Helly, normal He...
متن کاملThe intersection between some subclasses of circular-arc and circle graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. The intersection graph of a family of chords in a circle is called a circle graph. Analogously, this class of graphs admits some subcla...
متن کاملCharacterizations and recognition of circular-arc graphs and subclasses: A survey
Circular graphs are intersection graphs of arcs on a circle. These graphs are reported to have been studied since 1964, and they have been receiving considerable attention since a series of papers by Tucker in the 1970s. Various subclasses of circular-arc graphs have also been studied. Among these are the proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and co-bip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2014